package DMSXL._2024.DP;

public class climbStairs {
    public static void main(String[] args) {

    }
    public int climbStairs(int n){
        int[] dp = new int[n + 2];
        dp[0] = 1;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];

    }
}
